﻿#include <cstddef>
#include <string>
#include <iostream>
#include <ctype.h>
#include <map>
#include <vector>   
#include "AVLTree.h"
using namespace std;
int main()
{
	AVLTree<int, nullptr_t> tree;//测试单关键字
    int a[] = { 4,2,6,1,3,5,15,7,16,14 };
    for (auto e : a)
    {
        tree.insert(make_pair(e, nullptr));
        cout << "插入" << e << ",";
        if (tree.is_balance())
            cout << "树是平衡的" << endl;
        else
            cout << "树是**不**平衡的" << endl;
    }
	return 0;
}
